On relations between CCZ- and EA-equivalences

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CCZ and EA equivalence between mappings over finite Abelian groups

CCZand EA-equivalence, which are originally defined for vectorial Boolean functions, are extended to mappings between finite abelian groups G and H. We obtain an extension theorem for CCZequivalent but not EA-equivalent mappings. Recent results in [1] are improved and generalized.

متن کامل

EA and CCZ Equivalence of Functions over GF(2n)

EA-equivalence classes and the more general CCZ-equivalence classes of functions over GF (2) each preserve APN and AB properties desirable for S-box functions. We show that they can be related to subsets c[T ] and g[T ] of equivalence classes [T ] of transversals, respectively, thus clarifying their relationship and providing a new approach to their study. We derive a formula which characterise...

متن کامل

Relationships Between CCZ and EA Equivalence Classes and Corresponding Code Invariants

The purpose of this paper is to provide a brief survey of CCZ and EA equivalence for functions f : G → N where G and N are finite and N is abelian, and, for the case f : Zp → Zp , to investigate two codes derived from f , inspired by these equivalences. In particular we show the dimension of the kernel of each code determines a new invariant of the corresponding equivalence class. We present co...

متن کامل

turkish-israeli relations and their implication on iranian national security

this dissertation has six chapter and tree appendices. chapter 1 introduces the thesis proposal including description of problem, key questions, hypothesis, backgrounds and review of literature, research objectives, methodology and theoretical concepts (key terms) taken the literature and facilitate an understanding of national security, national interest and turkish- israeli relations concepts...

15 صفحه اول

Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences

There are two ways to define a semantics for process algebras: either directly by means of an equivalence relation or by means of a preorder whose kernel is the desired equivalence. We are interested in the relationship between these two presentations. Using our characterisation of the behaviour preorders by means of simulations up-to we were able to generate the canonical preorders correspondi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cryptography and Communications

سال: 2019

ISSN: 1936-2447,1936-2455

DOI: 10.1007/s12095-019-00367-5